Combinatorial Optimization in Pattern Assembly
نویسنده
چکیده
Pattern self-assembly tile set synthesis (Pats) is a combinatorial optimization problem which aim at minimizing a rectilinear tile assembly system (RTAS) that uniquely self-assembles a given rectangular pattern, and is known to be NP-hard. Pats gets practically meaningful when it is parameterized by a constant c such that any given pattern is guaranteed to contain at most c colors (c-Pats). We first investigate simple patterns and properties of minimum RTASs for them. Then based on them, we design a 59-colored pattern to which 3Sat is reduced, and prove that
منابع مشابه
Optimization of profit and customer satisfaction in combinatorial production and purchase model by genetic algorithm
Optimization of inventory costs is the most important goal in industries. But in many models, the constraints are considered simple and relaxed. Some actual constraints are to consider the combinatorial production and purchase models in multi-products environment. The purpose of this article is to improve the efficiency of inventory management and find the economic order quantity and economic p...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملResearch on Industrial Assembly Line Balancing Optimization Based on Genetic Algorithm and Witness Simulation
With the rapid development of the industry sector, the assembly line has also experienced development, whose rationality determines the production efficiency of industrial production. In this paper, in order to address the balancing issue of assembly lines for industrial production, a combinatorial optimization method is proposed for the optimization and implementation of the assembly line base...
متن کاملBalancing fuzzy multi-objective two-sided assembly lines via Bees Algorithm
Many real life problems contain imprecise variables, constraints and objectives. Fuzzy set theory gives an opportunity to handle imprecise terms in such situations. Two-sided assembly line balancing (2sALB) problem which is a generalization of the well known simple assembly line balancing problem can also be modeled more realistically by employing fuzzy approaches. Such an approach is presented...
متن کاملSymbolic ZBDD Representations for Mechanical Assembly Sequences
The representations of assembly knowledge and assembly sequences are crucial in assembly planning, where the size of parts involved is a significant and often prohibitive difficulty. Zero-suppressed binary decision diagram (ZBDD) is an efficient form to represent and manipulate the sets of combination, and appears to give improved results for large-scale combinatorial optimization problems. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1301.3771 شماره
صفحات -
تاریخ انتشار 2013